Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
691	Local reductions Hamid Jahanjou∗ Eric Miles∗ Emanuele Viola∗ Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2014-04-01 09:13:02 Complexity classes Circuit complexity Boolean algebra NP-complete problems Time complexity ACC0 Cook–Levin theorem P NC Theoretical computer science Computational complexity theory Applied mathematics
692	Journal of Artificial Intelligence Research234 Submitted 8/14; published 1/15 On the Subexponential-Time Complexity of CSP Ronald de Haan Add to Reading List Source URL: www.jair.org Language: English - Date: 2015-01-30 21:27:29 Constraint programming Constraint satisfaction problem Constraint satisfaction Exponential time hypothesis Boolean satisfiability problem NP-complete Tree decomposition Conjunctive normal form Time complexity Theoretical computer science Applied mathematics Computational complexity theory
693	The Mathematics of Algorithm Design about all these algorithms without recourse to specific computing devices or computer programming languages, instead expressing them using the language of mathematics. In fact, the not Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2006-02-14 23:00:29 Complexity classes Mathematical optimization NP-complete problems Operations research Travelling salesman problem Algorithm Minimum spanning tree Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
694	Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT ? Alberto Griggio1 , Quoc-Sang Phan2 , Roberto Sebastiani2 and Silvia Tomasi2 Add to Reading List Source URL: disi.unitn.it Language: English - Date: 2011-10-12 05:34:03 Mathematics Logic in computer science NP-complete problems Electronic design automation Formal methods Satisfiability Modulo Theories WalkSAT Resolution Local search Theoretical computer science Constraint programming Applied mathematics
695	MLRG: Bayes. Net. Complexity Kui Tang Background Definitions Add to Reading List Source URL: kui-tang.com Language: English Complexity classes Bayesian statistics Graphical models Statistical models Bayesian network NP P-complete Belief propagation Reduction Theoretical computer science Computational complexity theory Applied mathematics
696	Journal of Artificial Intelligence Research606 Submitted 11/07; publishedSATzilla: Portfolio-based Algorithm Selection for SAT Lin Xu Add to Reading List Source URL: www.jair.org Language: English - Date: 2008-07-01 13:34:37 NP-complete problems Logic in computer science Electronic design automation Formal methods Boolean algebra Boolean satisfiability problem Algorithm Computational complexity theory Solver Theoretical computer science Applied mathematics Mathematics
697	The Complexity of Degree Anonymization by Vertex Addition Robert Bredereck? , Vincent Froese?? , Sepp Hartung, Andr´e Nichterlein, Rolf Niedermeier, and Nimrod Talmon? ? ? Institut f¨ ur Softwaretechnik und Theoretisch Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-04-17 07:44:41 NP-complete problems Degree Tree Independent set Clique Connectivity Vertex Graph Neighbourhood Graph theory Theoretical computer science Mathematics
698	The Power of Local Search: Maximum Coverage over a Matroid Yuval Filmus1,2 and Justin Ward1 1 2 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2011-12-02 06:14:39 NP-complete problems Matroid theory Operations research Submodular set function Matroid Greedy algorithm Set cover problem Linear programming Algorithm Mathematics Theoretical computer science Applied mathematics
699	Artificial Intelligence–120 www.elsevier.com/locate/artint Compiling problem specifications into SAT ✩ Marco Cadoli a,∗ , Andrea Schaerf b a Dipartimento di Informatica e Sistemistica, Università di Add to Reading List Source URL: www.diegm.uniud.it Language: English - Date: 2008-12-11 12:42:15 Complexity classes NP-complete problems Mathematical optimization Logic in computer science Boolean satisfiability problem Electronic design automation NP-complete 2-satisfiability NP Theoretical computer science Computational complexity theory Applied mathematics
700	AN ALGORITHM FOR DETECTING INTRINSICALLY KNOTTED GRAPHS arXiv:1109.1030v2 [math.GT] 9 OctJONATHAN MILLER AND RAMIN NAIMI Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-10-09 21:48:19 Linkless embedding Graph embedding Robertson–Seymour theorem Minor Chordal graph Complete graph Petersen family Planar graphs Graph theory Topological graph theory Knot theory

UPDATE